A Deductive Pattern Matcher
نویسنده
چکیده
This paper describes the design of a pattern matcher for a knowledge representation system called LOOM. The pattern matcher has a very rich pattern-forming language, and is logic-based, with a deductive mechanism which includes a truth-maintenance component as an integral part of the pattern-matching logic. The technology behind the LOOM matcher uses an inference engine called a classiier to perform the matches. The LOOM matcher is more expressive and more complete than previous classiication-based pattern-matchers, and is expected to be signiicantly more eecient.
منابع مشابه
Partial Evaluation of Pattern Matching in Strings, revisited
Specializing string matchers is a canonical example of partial evaluation. A naive implementation of a string matcher repeatedly matches a pattern against every substring of the data string; this operation should intuitively benefit from specializing the matcher with respect to the pattern. In practice, however, producing an efficient implementation by performing this specialization using stand...
متن کاملMK Pattern Match Compilation and Partial Evaluation
We derive a compiler for ML-style pattern matches. It is conceptually simple and produces reasonably good compiled matches. The derivation is inspired by the instrumentation and partial evaluation of na ve string match-ers. Following that paradigm, we rst present a general and na ve ML pattern matcher, instrument it to collect and exploit extra information, and show that partial evaluation of t...
متن کاملML pattern match compilation and partial evaluation
We derive a compiler for ML style pattern matches It is conceptu ally simple and produces reasonably good compiled matches The derivation is inspired by the instrumentation and partial evaluation of na ve string match ers Following that paradigm we rst present a general and na ve ML pattern matcher instrument it to collect and exploit extra information and show that partial evaluation of the in...
متن کاملA Dynamically Reconfigurable Pattern Matcher for Regular Expressions on FPGA
In this article we describe how to expand a partially dynamic reconfigurable pattern matcher for regular expressions presented in previous work by Divyasree and Rajashekar [2]. The resulting, extended, pattern matcher is fully dynamically reconfigurable. First, the design is adapted for use with parameterisable configurations, a method for Dynamic Circuit Specialization. Using parameterisable c...
متن کاملPartial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack
Partial version presented at Workshop for Static Analysis (Bor-deaux France) october 1992. Abstract Symbolic pattern matching as ooered by Lisp dialects allows to scan Sexpressions, to verify their shape and to extract or compare subparts of them. A rich set of patterns exists and among them alternate patterns. Such patterns are handled through backtrack: a failure forces the pattern matcher to...
متن کامل